منابع مشابه
F. F. F. F.—2000 A.d
During World War I there was much lamentation over the "defects of the draft," and the word "shocking" was in frequent use with reference to the condition of a large proportion of men of military age. When, more recently, it became necessary again for society to interpose a shield of human lives between itself and disaster, its cerebral cells once more became agitated over the report that its y...
متن کاملf-DERIVATIONS AND (f; g)-DERIVATIONS OF MV -ALGEBRAS
Recently, the algebraic theory of MV -algebras is intensively studied. In this paper, we extend the concept of derivation of $MV$-algebras and we give someillustrative examples. Moreover, as a generalization of derivations of $MV$ -algebraswe introduce the notion of $f$-derivations and $(f; g)$-derivations of $MV$-algebras.Also, we investigate some properties of them.
متن کاملF -pure Homomorphisms, Strong F -regularity, and F -injectivity
We discuss Matijevic–Roberts type theorem on strong F -regularity, F -purity, and Cohen–Macaulay F -injective (CMFI for short) property. Related to this problem, we also discuss the base change problem and the openness of loci of these properties. In particular, we define the notion of F -purity of homomorphisms using Radu–André homomorphisms, and prove basic properties of it. We also discuss a...
متن کاملReinforcement Learning Based on Internal-Dynamics-Derived Exploration Using a Chaotic Neural Network
[訂正内容] ・図3,図4,図5,図6は図の差し替えを行いました。 ・4ページ右コラム最後の段落の5行目 (訂正前) 8試行中2試行でゴールに到達した。その他の6試行も,100ステップで試行を終了しな ければ,1,000ステップ以内でゴールに到達した。 (訂正後) 8試行中3試行でゴールに到達した。その他の5試行も,100ステップで試行を終了しな ければ,2,000ステップ以内でゴールに到達した。 ・4ページ右コラム最後の段落の9行目 (訂正前) 最適ステップ数は9であるが,10-13ステップでゴールした。 (訂正前) 少し回り道をすることもあるが,より少ないステップ数でゴールした。 ・4ページ右コラム下から2行目 (訂正前) (訂正後) 10または 11ステップでゴール 10から 12ステップでゴール ・5ページ左コラム下から2行目 (訂正前) (訂正後) 大きく値が変化している ...
متن کاملContinuity of the maps f↦∪x∈Iω(x, f) and f↦{ω(x, f): x∈I}
We study the behavior of two maps in an effort to better understand the stability of ωlimit sets ω(x, f ) as we perturb either x or f , or both. The first map is the set-valued function Λ taking f in C(I ,I) to its collection of ω-limit points Λ( f ) = ⋃x∈I ω(x, f ), and the second is the map Ω taking f in C(I ,I) to its collection of ω-limit sets Ω( f )= {ω(x, f ) : x ∈ I}.We characterize thos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Seikei-Kakou
سال: 2006
ISSN: 0915-4027,1883-7417
DOI: 10.4325/seikeikakou.18.34_1